Coarsening, Sampling, and Smoothing: Elements of the Multilevel Method
نویسندگان
چکیده
The multilevel method has emerged as one of the most eeective methods for solving numerical and combinatorial problems. It has been used in multigrid, domain decomposition, geometric search structures, as well as optimization algorithms for problems such as partitioning and sparse-matrix ordering. This paper presents a systematic treatment of the fundamental elements of the multilevel method. We illustrate, using examples from several elds, the importance and eeectiveness of coarsening, sampling, and smoothing (local optimization) in the application of the multilevel method.
منابع مشابه
Algebraic Multigrid for High-Order Hierarchical H(curl) Finite Elements
Classic multigrid methods are often not directly applicable to nonelliptic problems such as curl-type partial differential equations (PDEs). Curl-curl PDEs require specialized smoothers that are compatible with the gradient-like (near) null space. Moreover, recent developments have focused on replicating the grad-curl-div de Rham complex in a multilevel hierarchy through smoothed aggregation ba...
متن کاملSampling and multilevel coarsening algorithms for fast matrix approximations
This paper addresses matrix approximation problems for matrices that are large, sparse and/or that are representations of large graphs. To tackle these problems, we consider algorithms that are based primarily on coarsening techniques, possibly combined with random sampling. A multilevel coarsening technique is proposed which utilizes a hypergraph associated with the data matrix and a graph coa...
متن کاملAlgebraic multilevel preconditioners with projectors∗
A new multilevel algebraic preconditioner for symmetric positive definite matrices is proposed. The projection and smoothing steps typical for textbook multigrids are replaced by a special coarsening algorithm which is based on orthogonal projectors onto kernels of subdomain matrices. The preconditioner is compared numerically with a few other multigrid preconditioners.
متن کاملA coarsening finite element strategy in image selective smoothing
We introduce the coarsening of finite element computational grid strategy into the method proposed by Kačur and Mikula in [11] for the numerical solution of the Perona–Malik model modified in the sense of Catté, Lions, Morel and Coll. It improves the efficiency of the method, while the solution tends to be more flat during the selective smoothing process applied to the image. The numerical appr...
متن کاملIterations for the Airfoil Mesh. Multiplicative Schwarz
Overlap Level of Regular Dual graph (no. elements) coarse grid coarsening coarsening 0 None 56 56 0 4 21 22 0 3 15 12 1 None 16 16 1 4 10 10 1 3 7 7 2 None 14 14 2 4 8 8 2 3 5 5 Table 2 Multigrid iterations for the Airfoil mesh Regular coarsening Dual graph coarsening MG Levels Nodes Dir. B. Overlapping schwarz methods on unstructured meshes using non-matching coarse grids. Domain decomposition...
متن کامل